Browsing by Subject "Computational complexity"

Now showing items 1-20 of 65

    • Article  

      ACLP: Abductive Constraint Logic Programming 

      Kakas, Antonis C.; Michael, Antonia; Mourlas, Constantinos (2000)
      This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and ...
    • Article  

      Aggregated bandwidth allocation: Investigation of performance of classical constrained and genetic algorithm based optimisation techniques 

      Pitsillides, Andreas; Stylianou, Georgios; Pattichis, Constantinos S.; Sekercioglu, Y. Ahmet; Vasilakos, Athanasios V. (2002)
      We consider a high speed integrated services network, and investigate compare and contrast the performance of two algorithms for solving the Aggregated Bandwidth Allocation (BA) problem. The algorithms we focus our attention ...
    • Article  

      Analytic residues along algebraic cycles 

      Berenstein, Carlos A.; Vidras, Alekos; Yger, A. (2005)
      Let W be a q-dimensional irreducible algebraic subvariety in the affine space A C n, P1,..., Pm m elements in C[X1,...,Xn], and V(P) the set of common zeros of the Pj's in C n. Assuming that W is not included in V(P), one ...
    • Conference Object  

      An approach for developing adaptive, mobile applications with separation of concerns 

      Paspallis, Nearchos; Papadopoulos, George Angelos (2006)
      Modern mobile computing paradigms have set new challenges for the development of distributed mobile applications and services. Because of the variability which characterizes the context of such environments, it is important ...
    • Article  

      Atemplate-based modeling approach for system design: Theory and implementation 

      Stein, J. L.; Louca, Loucas S. (1996)
      Previous research has developed search algorithms for deducing Proper Models (minimum complexity models with physically meaningful parameters) of dynamic systems. It has also been proposed that these Proper Models can be ...
    • Conference Object  

      Bandwidth Allocation for Virtual Paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimization techniques 

      Pitsillides, Andreas; Stylianou, Georgios; Pattichis, Constantinos S.; Sekercioglu, Y. Ahmet; Vasilakos, Athanasios V. (2000)
      We investigate the performance of a classical constrained optimization (CCO) algorithm and a constrained optimization Genetic Algorithm (GA) for solving the Bandwidth Allocation for Virtual Paths (BAVP) problem. We compare ...
    • Conference Object  

      Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2002)
      The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
    • Article  

      Coding techniques for fault-tolerant parallel prefix computations in Abelian groups 

      Hadjicostis, Christoforos N. (2004)
      This paper presents coding techniques that can be used to provide fault tolerance to a parallel prefix computation that is performed on a binary tree of processing nodes. More specifically, we discuss how a parallel prefix ...
    • Article  

      Complexity of rational and irrational Nash equilibria 

      Bilò, Vittorio; Mavronicolas, Marios (2011)
      We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
    • Article  

      The complexity of synchronous iterative Do-All with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2004)
      The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
    • Conference Object  

      Computational intelligence in management of ATM networks: a survey of current state of research 

      Sekercioglu, Y. Ahmet; Pitsillides, Andreas; Vasilakos, Athanasios V. (1999)
      Today, a number of researchers are looking at alternative non-analytical control system design and modeling techniques that have the ability to devise effective, robust ATM network management schemes. Such schemes employ ...
    • Conference Object  

      Computing Nash equilibria for scheduling on restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2004)
      We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...
    • Article  

      Content-selection strategies for the periodic prefetching of WWW resources via satellite 

      Dikaiakos, Marios D.; Stassopoulou, Athena (2001)
      In this paper we study satellite-caching, that is, the employment of satellite multicasting for the dissemination of prefetched content to WWW caches. This approach is currently being deployed by major satellite operators ...
    • Article  

      Crowds by example 

      Lerner, A.; Chrysanthou, Yiorgos L.; Lischinski, D. (2007)
      We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restricted set of rules. This assumption limits ...
    • Article  

      D3-machine: A decoupled data-driven multithreaded architecture with variable resolution support 

      Evripidou, Paraskevas (2001)
      This paper presents the Decoupled Data-Driven machine (D3-machine), a multithreaded architecture with data-driven synchronization. The D3-machine is an efficient and cost-effective design that combines the advantages of ...
    • Article  

      Direct routing: Algorithms and complexity 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2006)
      Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...
    • Article  

      Direct routing: Algorithms and complexity 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2004)
      Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
    • Conference Object  

      Distributed Cooperation and Adversity: Complexity Trade-Offs 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2003)
      The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...
    • Article  

      The Do-All problem with Byzantine processor failures 

      Fernández, A.; Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2005)
      Do-All is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of trade-offs between ...
    • Conference Object  

      Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control 

      Fatourou, Panagiota; Mavronicolas, Marios; Spirakis, Paul G. (ACM, 1997)
      Lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, rate-based flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler ...